A method of making proofs involving numerous cases readable
نویسندگان
چکیده
منابع مشابه
Making Readability Indices Readable
Although many approaches have been presented to compute and predict readability of documents in different languages, the information provided by readability systems often fail to show in a clear and understandable way how difficult a document is and which aspects contribute to content readability. We address this issue by presenting a system that, for a given document in Italian, provides not o...
متن کاملMaking Data Models Readable
Second, it represents the fundamental architecture of an enterprise’s data, and as such is an ideal starting place for database design. To be sure, the final structure of a database may differ from the data model for good and valid reasons, but the closer it remains to the original structure, the more likely it is to be able to resist requirements for future changes. To the system designer and ...
متن کاملNumerous Proofs of ζ ( 2 ) = π 2 6 Brendan
In this talk, we will investigate how the late, great Leonhard Euler originally proved the identity ζ(2) = ∑∞ n=1 1/n 2 = π/6 way back in 1735. This will briefly lead us astray into the bewildering forest of complex analysis where we will point to some important theorems and lemmas whose proofs are, alas, too far off the beaten path. On our journey out of said forest, we will visit the temple o...
متن کاملAutomated Geometry Theorem Proving for Human-Readable Proofs
Geometry reasoning and proof form a major and challenging component in the K-121 mathematics curriculum. Although several computerized systems exist that help students learn and practice general geometry concepts, they do not target geometry proof problems, which are more advanced and difficult. Powerful geometry theorem provers also exist, however they typically employ advanced algebraic metho...
متن کاملHuman-readable Machine-veriiable Proofs for Teaching Constructive Logic
A linear syntax for natural deduction proofs in rst-order in-tuitionistic logic is presented, which has been an eeective tool for teaching logic. The proof checking algorithm is also given, which is the core of the tutorial proof checker Tutch. This syntax is then extended to proofs on the assertion level which resemble single inferences one would make in a rigorous proof. The resulting languag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1973
ISSN: 0022-314X
DOI: 10.1016/0022-314x(73)90033-4